In defence of Dedekind and Heine–Borel Paul Taylor Third Workshop on Formal Topology Padova, mercoled`ı, il 9 Maggio 2007

Source URL: www.paultaylor.eu

• Metric geometry
• Real analysis
• Least-upper-bound property
• Order theory
• Cauchy sequence
• Real number
• Mathematical logic
• Complete metric space
• Compact space
• Mathematics
• Mathematical analysis
• Topology

Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies Santiago Figueira Daniel Gor´ın

Source URL: www.glyc.dc.uba.ar

• Model theory
• Logical syntax
• Philosophical logic
• Interpretation
• Entailment
• First-order logic
• Prenex normal form
• Well-formed formula
• Logical connective
• Logic
• Metalogic
• Formal languages

SOCIOLOGY 70100: DEVELOPMENT OF SOCIOLOGICAL THEORY (ACTION AND ORDER) Fall 2007 James M. Jasper

Source URL: www.jamesmjasper.org

An Abstract Completion Procedure for Cut Elimination in Deduction Modulo Guillaume Burel École Normale Supérieure de Lyon & LORIA∗ The complementarity and interaction between computation

Source URL: www.ensiie.fr

• Cut-elimination theorem
• Sequent
• Rule of inference
• First-order logic
• Formal proof
• Natural deduction
• Structural proof theory
• Logic
• Proof theory
• Mathematical logic

The Dedekind Reals in Abstract Stone Duality Andrej Bauer and Paul Taylor 3 June 2009 Abstract Abstract Stone Duality (ASD) is a direct axiomatisation of general topology, in contrast to the traditional and all other con

Source URL: www.paultaylor.eu

• General topology
• Order theory
• Real analysis
• Calculus
• Measure theory
• Least-upper-bound property
• Compact space
• Intermediate value theorem
• Continuous function
• Mathematical analysis
• Topology
• Mathematics

First-order reasoning in Yices2 Master Thesis in Computer Science Simon Cruanes∗ supervised by Bruno Dutertre †, Viktor Kuncak ‡, Benjamin Werner § SRI International, Menlo Park, CA September 2011 – March 2012

Source URL: cedeela.fr

• Automated theorem proving
• Model theory
• Logic in computer science
• Constraint programming
• NP-complete problems
• Boolean satisfiability problem
• Satisfiability Modulo Theories
• DPLL algorithm
• Interpretation
• Theoretical computer science
• Logic
• Mathematical logic

On the Formal Semantics of IF-like Logics Santiago Figueiraa,b , Daniel Gor´ına , Rafael Grimsonc a Departamento de Computaci´ on, FCEyN

Source URL: www.glyc.dc.uba.ar

• Model theory
• Predicate logic
• Non-classical logic
• Quantification
• Interpretation
• First-order logic
• Independence-friendly logic
• FO
• Lambda calculus
• Logic
• Mathematical logic
• Philosophical logic

Fleeting Orders By Shmuel Baruch and Lawrence R. Glosten∗ June 11, 2013 We study a dynamic limit order market with a finite number of

Source URL: www.dsf.nl

• Finance
• Investment
• Mathematical finance
• Financial markets
• Nash equilibrium
• Order
• High-frequency trading
• Futures contract
• Stock market
• Game theory
• Financial economics

SNApp_Presentation_r3.ppt

Source URL: www.parker.com

• Order theory
• Air filter
• Filtration
• Oil filter
• Chemistry
• Filter
• General topology

Interval Analysis Without Intervals Paul Taylor 20 February 2006 Abstract We argue that Dedekind completeness and the Heine–Borel property should be seen as part of the “algebraic” structure of the real line, along

Source URL: www.paultaylor.eu

• Order theory
• Real analysis
• Differential calculus
• Elementary mathematics
• Continuous function
• Dedekind cut
• Fundamental theorem of calculus
• Integral
• Least-upper-bound property
• Mathematical analysis
• Mathematics
• Functions and mappings